Negative De nability in Modal Logic
نویسنده
چکیده
The aim of this paper is to give characterizations of the notion of negative de nability as introduced in Venema This notion can be seen as an alternative way of de ning classes of Kripke frames via a modal language one that enables us for instance to de ne the previously unde nable class of irre exive frames Besides a list of closure conditions for negatively de nable classes the paper contains two main theorems First a characterization is given of negatively de ned classes of nite transitive Kripke frames Second we characterize the negatively de ned classes of general frames
منابع مشابه
De nability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic
This paper studies coalgebras from the perspective of the nitary observations that can be made of their behaviours. Based on the terminal sequence, notions of nitary behaviours and nitary predicates are introduced. A category Behω(T ) of coalgebras with morphisms preserving nitary behaviours is de ned. We then investigate de nability and compactness for nitary coalgebraic modal logic, show that...
متن کاملCs - R 9517 1995
This paper contributes to the model theory of modal logic using bisimulations as the fundamental tool A uniform presentation is given of modal analogues of well known de nability and preservation results from rst order logic These results include algebraic characterizations of modal equivalence and of the modally de nable classes of models the preservation results concern preservation of modal ...
متن کاملThe Modal Logic of Generic Multiverses
In this thesis, we investigate the modal logic of forcing and the modal logic of grounds of generic multiverses. Hamkins and Löwe showed that the ZFC-provable modal principles of forcing, as well as of grounds, are exactly the theorems of the modal logic S4.2 (see [16],[17]). We prove that the modal logic of forcing of any generic multiverse is also exactly S4.2 by showing that any model of ZFC...
متن کاملGentzen Sequent Calculus for Possibilistic Reasoning
Possibilistic logic is an important uncertainty reasoning mech anism based on Zadeh s possibility theory and classical logic The deduc tion rules of possibilistic logic have been obtained from classical resolu tion rule by attaching possibility or necessity weight to ordinary clauses However since not all possibility valued formulae can be converted into equivalent possibilistic clauses the res...
متن کاملBeth De nability for the Guarded
The guarded fragment (GF) was introduced in ABN98] as a fragment of rst order logic which combines a great expressive power with nice modal behavior. It consists of relational rst order formulas whose quantiiers are relativized by atoms in a certain way. While GF has been established as a particularly well-behaved fragment of rst order logic in many respects, interpolation fails in restriction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994